Towards matrix model representation of HOMFLY polynomials
نویسندگان
چکیده
منابع مشابه
Homfly and Kauffman polynomials
We calculate the dimensions of the space of Vassiliev invariants coming from the Homfly polynomial of links, and of the space of Vassiliev invariants coming from the Kauffman polynomial of links. We show that the intersection of these spaces is spanned by the Vassiliev invariants coming from the Jones polynomial and from a polynomial called Υ. We also show that linearly independent Vassiliev in...
متن کاملHOMFLY Polynomials of Torus Links as Generalized Fibonacci Polynomials
The focus of this paper is to study the HOMFLY polynomial of (2, n)-torus link as a generalized Fibonacci polynomial. For this purpose, we first introduce a form of generalized Fibonacci and Lucas polynomials and provide their some fundamental properties. We define the HOMFLY polynomial of (2, n)-torus link with a way similar to our generalized Fibonacci polynomials and provide its fundamental ...
متن کاملOn the Homfly and Tutte Polynomials
A celebrated result of F. Jaeger states that the Tutte polynomial of a planar graph is determined by the HOMFLY polynomial of an associated link. Here we are interested in the converse of this result. We consider the question ‘to what extent does the Tutte polynomial determine the HOMFLY polynomial of any knot?’ We show that the HOMFLY polynomial of a knot is determined by Tutte polynomials of ...
متن کاملMatrix Representation for the Beta Type Polynomials
The aim of this paper is to study and investigate some new properties of the beta polynomials. Taking derivative of the generating functions for beta type polynomials, we give two partial differential equations (PDEs). By using these PDEs, we derive derivative formulas of the beta type polynomials. In order to construct a matrix representation for the beta polynomials, we firstly show that the ...
متن کاملEstimating Jones and Homfly polynomials with one clean qubit
The Jones and HOMFLY polynomials are link invariants with close connections to quantum computing. It was recently shown that finding a certain approximation to the Jones polynomial of the trace closure of a braid at the fifth root of unity is a complete problem for the one clean qubit complexity class[18]. This is the class of problems solvable in polynomial time on a quantum computer acting on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JETP Letters
سال: 2014
ISSN: 0021-3640,1090-6487
DOI: 10.1134/s0021364014160036